Lattices of Subautomata and Direct Sum Decompositions of Automata
نویسندگان
چکیده
The subject of this paper are general properties of direct sum decompositions of automata. Using certain properties of the lattice Sub(A) of subautomata of an automaton A and its Boolean part, lattices of direct sum congruences and direct sum decompositions of A are characterized. We show that every automaton A can be represented as a direct sum of direct sum indecomposable automata, and that the lattice Sub(A) can be represented as a direct product of directly indecomposable lattices. Some special types of direct sum decompositions of automata are also investigated. 1991 Mathematics Subject Classification: 68Q70, 08A70
منابع مشابه
Distributive lattices with strong endomorphism kernel property as direct sums
Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem 2.8}). We shall determine the structure of special elements (which are introduced after Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...
متن کاملModeling the main and maximum subautomata of an active general fuzzy automaton
In this paper, subcategories with threshold c are examined from an active general fuzzy automaton and the generator from an active general fuzzy automaton is defined and the connections between them are examined. Then, under the main and maximum automata with threshold c, one of the active general fuzzy automata will be defined, and it will be proved that each active general fuzzy automaton can...
متن کاملDecompositions of Automata and Transition Semigroups
The purpose of this paper is to describe structural properties of automata whose transition semigroups have a zero, left zero, right zero or bi-zero, or are nilpotent extensions of rectangular bands, left zero bands or right zero bands, or are nilpotent. To describe the structure of these automata we use various well-known decomposition methods of automata theory – direct sum decompositions, su...
متن کاملSolving System of Linear Congruence Equations over some Rings by Decompositions of Modules
In this paper, we deal with solving systems of linear congruences over commutative CF-rings. More precisely, let R be a CF-ring (every finitely generated direct sum of cyclic R-modules has a canonical form) and let I_1,..., I_n be n ideals of R. We introduce congruence matrices theory techniques and exploit its application to solve the above system. Further, we investigate the application of co...
متن کاملDirect Product Decompositions of Lattices , Closures andRelation
In this paper we study the direct product decompositions of closure operations and lattices of closed sets. We characterize the direct product decompositions of lattices of closed sets in terms of closure operations, and nd those decompositions of lattices which correspond to the decompositions of closures. If a closure on a nite set is represented by its implication base (i.e. a binary relatio...
متن کامل